Group code structures on affine-invariant codes
نویسندگان
چکیده
A group code structure of a linear code is a description of the code as one-sided or two-sided ideal of a group algebra of a finite group. In these realizations, the group algebra is identified with the ambient space, and the group elements with the coordinates of the ambient space. It is well known that every affine-invariant code of length pm, with p prime, can be realized as an ideal of the group algebra FI, where I is the underlying additive group of the field with pm elements. In this paper we describe all the group code structures of an affine-invariant code of length pm in terms of a family of maps from I to the group of automorphisms of I. Affine-invariant codes were firstly introduced by Kasami, Lin and Peterson [KLP2] as a generalization of Reed-Muller codes. This class of codes has received the attention of several authors because of its good algebraic and decoding properties [D, BCh, ChL, Ho, Hu]. The length of an affine-invariant code is a prime power p, where p is the characteristic of the finite field F which plays the role of alphabet. It is well known that every affine-invariant code of length p over the field F can be realized as an ideal of the group algebra FI, where I is the underlying additive group of the field with p elements, i.e. I is the elementary abelian group of order p. In this realization, the group elements are identified with the elements of the standard base of the ambient space F m . We refer to these realizations of codes as one-sided or two-sided ideals in group algebras as group code structures of the given code. In this paper we study all the possible group code structures on an affine-invariant code. Our main tools are an intrinsical characterization of group codes obtained in [BRS] and a description of the group of permutation automorphisms of nontrivial affine-invariant codes given in [BCh]. These results are reviewed in Section 1, where we also recall the definition and main properties of affine-invariant codes. In Section 2, we describe all the group code structures of an affineinvariant code C in terms of a family of maps I → Ga,b where Ga,b is a subgroup of the group of automorphism of I depending on two integers a and b which ∗ Departamento de Matemáticas, Universidad de Murcia, 30100 Murcia. Spain. email: [email protected], [email protected], [email protected] Partially supported by D.G.I. of Spain and Fundación Séneca of Murcia.
منابع مشابه
There Are Not Non-obvious Cyclic Affine-invariant Codes
We show that an affine-invariant code C of length p is not permutation equivalent to a cyclic code except in the obvious cases: m = 1 or C is either {0}, the repetition code or its dual. Affine-invariant codes were firstly introduced by Kasami, Lin and Peterson [KLP2] as a generalization of Reed-Muller codes. This class of codes has received the attention of several authors because of its good ...
متن کاملThe permutation group of affine-invariant extended cyclic codes
The extended cyclic codes of length p” , p a prime, which are invariant under the aff ine-group acting on ffpm, are called affine-invariant codes. Following recent results of Berger, we present the formal expression of the permutat ion group of these codes. Afterwards we give several tools in order to determine effectively the group of a given code or of some infinite class of codes. W e next p...
متن کاملThe Automorphism Groups of BCH Codes and of Some Affine-Invariant Codes Over Extension Fields
Affine-invariant codes are extended cyclic codes of length pm invariant under the affine-group acting on Fpm . This class of codes includes codes of great interest such as extended narrow-sense BCH codes. In recent papers, we classified the automorphism groups of affine-invariant codes [2], [5]. We derive here new results, especially when the alphabet field is an extension field, by expanding o...
متن کاملOn the Security of Some Compact Keys for McEliece Scheme
In this paper we study the security of the key of compact McEliece schemes based on alternant/Goppa codes with a non-trivial permutation group, in particular quasicyclic alternant codes. We show that it is possible to reduce the key-recovery problem on the original quasi-cyclic code to the same problem on a smaller code derived from the public key. This result is obtained thanks to the invarian...
متن کاملSuccinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single local constraint and its translations under the symmetry group of the code. We show that the dual of every “sparse” binary code whose coordinates are indexed by elements of F2n for prime n, and whose symmetry group includes the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0903.1033 شماره
صفحات -
تاریخ انتشار 2009